On pseudofrobenius imprimitive association schemes
نویسندگان
چکیده
An (association) scheme is said to be Frobenius if it the (orbital) of a group. A which has same tensor intersection numbers as some pseudofrobenius. We establish necessary and sufficient condition for an imprimitive pseudofrobenius Frobenius. also prove strong conditions existence not As byproduct, we obtain group G with abelian kernel determined up isomorphism only by character table G. Finally, that Weisfeiler-Leman dimension circulant graph n vertices automorphism equal 2 unless $$n\in \{p,p^2,p^3,pq,p^2q\}$$ , where p q are distinct primes.
منابع مشابه
Imprimitive Q-polynomial Association Schemes
It is well known that imprimitive P -polynomial association schemes X = (X, {Ri}0≤i≤d) with k1 > 2 are either bipartite or antipodal, i.e., intersection numbers satisfy either ai = 0 for all i, or bi = cd−i for all i 6= [d/2]. In this paper, we show that imprimitiveQ-polynomial association schemesX = (X, {Ri}0≤i≤d) with d > 6 and k∗ 1 > 2 are either dual bipartite or dual antipodal, i.e., dual ...
متن کاملImprimitive cometric association schemes: Constructions and analysis
Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others ...
متن کاملSome new constructions of imprimitive cometric association schemes
In a recent paper [9], the authors introduced the extended Q-bipartite double of an almost dual bipartite cometric association scheme. Since the association schemes arising from linked systems of symmetric designs are almost dual bipartite, this gives rise to a new infinite family of 4-class cometric schemes which are both Q-bipartite and Q-antipodal. These schemes, the schemes arising from lin...
متن کاملOn Pseudocyclic Association Schemes
The notion of pseudocyclic association scheme is generalized to the non-commutative case. It is proved that any pseudocyclic scheme the rank of which is much more than the valency is the scheme of a Frobenius group and is uniquely determined up to isomorphism by its intersection number array. An immediate corollary of this result is that any scheme of prime degree, valency k and rank at least k...
متن کاملOn imprimitive rank 3 permutation groups
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2022
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-022-01193-4